The reliable hub-and-spoke design problem: Models and algorithms
نویسندگان
چکیده
منابع مشابه
The Reliable Hub-and-spoke Design Problem: Models and Algorithms
This paper presents a study on reliable single and multiple allocation hub-and-spoke network design problems where disruptions at hubs and the resulting hub unavailability can be mitigated by backup hubs and alternative routes. It builds nonlinear mixed integer programming models and presents linearized formulas. To solve those difficult problems, Lagrangian relaxation and Branch-and-Bound meth...
متن کاملReliable hub-and-spoke network design problems under uncertainty through multi-objective programming
HLP (hub location problem) tries to find locations of hub facilities and assignment of nodes to extended facilities. Hubs are facilities to collect, arrange, and distribute commodities in telecommunication networks, cargo delivery systems, etc. Hubs are very crucial and their inaccessibility impresses on network whole levels. In this paper, first, total reliability of the network is defined bas...
متن کاملEuclidean Hub-and-Spoke Networks
The hub-and-spoke distribution paradigm has been a fundamental principle in geographic network design for more than 40 years. One of the primary advantages that such networks possess is their ability to exploit economies of scale in transportation by aggregating network flows through common sources. In this paper, we consider the problem of designing an optimal hub-and-spoke network in continuo...
متن کاملA Hybrid Solution Method for Hub-and-Spoke Network Design under Uncertainty
Supply chain is an integrated system of facilities and activities. Gaining the optimum design of demand satisfaction network is one of the most important live issues in the decision making problems category. Most of previous studies considered unreal assumptions such as the lack of capacity constraints to satisfy demand in the network and in hubs. By considering the nature of the case that have...
متن کاملApproximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
This paper deals with a single allocation problem in hub-and-spoke networks. We present a simple deterministic 3-approximation algorithm and randomized 2-approximation algorithm based on a linear relaxation problem and a randomized rounding procedure. We handle the case where the number of hubs is three, which is known to be NP-hard, and present a (5/4)-approximation algorithm. The single alloc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part B: Methodological
سال: 2015
ISSN: 0191-2615
DOI: 10.1016/j.trb.2015.02.006